Algorithmic Aspects of Optimal Channel Coding
نویسندگان
چکیده
منابع مشابه
Algorithmic Aspects of Regularity
Szemer edi's celebrated regularity lemma proved to be a fundamental result in graph theory. Roughly speaking, his lemma states that any graph may be approximated by a union of a bounded number of bipartite graphs, each of which is`pseudorandom'. As later proved by Alon, Duke, Lefmann, RR odl, and Yuster, there is a fast deterministic algorithm for nding such an approximation, and therefore many...
متن کاملAlgorithmic Aspects of Boosting
We discuss algorithmic aspects of boosting techniques, such as Majority Vote Boosting [Fre95], AdaBoost [FS97], and MadaBoost [DW00a]. Considering a situation where we are given a huge amount of examples and asked to find some rule for explaining these example data, we show some reasonable algorithmic approaches for dealing with such a huge dataset by boosting techniques. Through this example, ...
متن کاملStatistical mechanical aspects of joint source-channel coding
– An MN-Gallager Code over Galois fields, q, based on the Dynamical Block Posterior probabilities (DBP) for messages with a given set of autocorrelations is presented with the following main results: a) for a binary symmetric channel the threshold, fc, is extrapolated for infinite messages using the scaling relation for the median convergence time, tmed ∝ 1/(fc− f); b) a degradation in the thre...
متن کاملPhysical-layer security: practical aspects of channel coding and cryptography
ACKNOWLEDGEMENTS Let me start at the beginning and thank my parents. They provided a glorious childhood for me and my siblings in a small town in northern Utah. They are extremely diligent and humble, and they raised their family to appreciate traditional Christian values. No matter where my career leads, if I can only duplicate their success with their children, then I will have no regrets. Th...
متن کاملDetecting quasiconvexity: Algorithmic aspects
The main result of this paper states that for any group G with an automatic structure L with unique representatives one can construct a uniform partial algorithm which detects L-rational subgroups and gives their preimages in L. This provides a practical, not just theoretical, procedure for solving the occurrence problem for such subgroups. 1. Generalized word problem and rational structures on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2696963